package com.acyouzi.leetcode.binarysearch;

import java.util.Stack;

/**
 * 17/9/11 16:31
 *
 * @author sunxu
 */
class TreeNode {
  int val;
  TreeNode left;
  TreeNode right;
  TreeNode(int x) { val = x; }
}
// https://leetcode.com/problems/find-mode-in-binary-search-tree/description/
public class ModeBinarySearch {
//  public int[] findMode(TreeNode root) {
//    Stack<TreeNode> stack = new Stack<>();
//    r
//  }
}
